Ring-magic labelings of graphs

نویسندگان

  • Wai Chee Shiu
  • Richard M. Low
چکیده

In this paper, a generalization of a group-magic graph is introduced and studied. Let R be a commutative ring with unity 1. A graph G = (V,E) is called R-ring-magic if there exists a labeling f : E → R−{0} such that the induced vertex labelings f : V → R, defined by f(v) = Σf(u, v) where (u, v) ∈ E, and f : V → R, defined by f(v) = Πf(u, v) where (u, v) ∈ E, are constant maps. General algebraic results for R-ringmagic graphs are established. In addition, Zn-ring-magic graphs and, in particular, trees are examined.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations

A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...

متن کامل

Magic graphs and the faces of the Birkhoff polytope

ABSTRACT Magic labelings of graphs are studied in great detail by Stanley in [18] and [19], and Stewart in [20] and [21]. In this article, we construct and enumerate magic labelings of graphs using Hilbert bases of polyhedral cones and Ehrhart quasi-polynomials of polytopes. We define polytopes of magic labelings of graphs and digraphs. We give a description of the faces of the Birkhoff polytop...

متن کامل

Magic Labelings on Cycles and Wheels

We present efficient algorithms to generate all edge-magic and vertex-magic total labelings on cycles, and all vertex-magic total labelings on wheels. Using these algorithms, we extend the enumeration of the total labelings on these classes of graphs.

متن کامل

Survey of certain valuations of graphs

The study of valuations of graphs is a relatively young part of graph theory. In this article we survey what is known about certain graph valuations, that is, labeling methods: antimagic labelings, edge-magic total labelings and vertex-magic total labelings.

متن کامل

Distance magic labelings of graphs

As a natural extension of previously defined graph labelings, we introduce in this paper a new magic labeling whose evaluation is based on the neighbourhood of a vertex. We define a 1-vertex-magic vertex labeling of a graph with v vertices as a bijection f taking the vertices to the integers 1, 2, . . . , v with the property that there is a constant k such that at any vertex x, ∑ y∈N(x) f(y) = ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2008